On the linear relaxation of the p-median problem
نویسندگان
چکیده
We study a well-known linear programming relaxation of the p-median problem. We give a characterization of the directed graphs for which this system of inequalities defines an integral polytope. As a consequence, we obtain that the p-median problem is polynomial in that class of graphs. We also give an algorithm to recognize these graphs. © 2011 Elsevier B.V. All rights reserved.
منابع مشابه
مساله پوشش هاب تک تخصیصی بر روی شبکه ستاره‌ای؛ مدل‌بندی، خطی‌سازی و یافتن کران مناسب برای آن
The present study evaluates two problems of single allocation hub-covering problem with star structure including two problems of maximal p-hub covering and hub covering by considering the flow transfer costs. The star structure is as there is a central hub with definite location and other hubs are connected directly to the central hub. In the first problem, the goal is selection of p-hub locati...
متن کاملNon-linear Static Modeling of Moderately Thick Functionally Graded Plate Using Dynamic Relaxation Method
In this paper, nonlinear static analysis of moderately thick plate made of functionally graded materials subjected to mechanical transverse loading is carried out using dynamic relaxation method. Mindlin first order shear deformation theory is employed to consider thick plate. Discretized equations are extracted for geometrically nonlinear behavior analysis.Loading Conditions and boundary condi...
متن کاملOn the Linear Relaxation of the p-Median Problem I: Oriented Graphs
We study a well known linear programming relaxation of the p-median problem. We characterize the oriented graphs for which this linear relaxation defines an integral polytope.
متن کاملON THE p-MEDIAN POLYTOPE OF A SPECIAL CLASS OF GRAPHS
In this paper we consider a well known class of valid inequalities for the p-median and the uncapacitated facility location polytopes, the odd cycle inequalities. It is known that their separation problem is polynomially solvable. We give a new polynomial separation algorithm based on a reduction from the original graph. Then, we define a nontrivial class of graphs, where the odd cycle inequali...
متن کاملA Novel Hybrid Modified Binary Particle Swarm Optimization Algorithm for the Uncertain p-Median Location Problem
Here, we investigate the classical p-median location problem on a network in which the vertex weights and the distances between vertices are uncertain. We propose a programming model for the uncertain p-median location problem with tail value at risk objective. Then, we show that it is NP-hard. Therefore, a novel hybrid modified binary particle swarm optimization algorithm is presented to obtai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Optimization
دوره 8 شماره
صفحات -
تاریخ انتشار 2011